A Framework for Search Heuristics
نویسنده
چکیده
Search heuristics, such as Tabu Search and Simulated Annealing, start from a single solution and incrementally change it in order to find better solutions. Given a particular problem, there are a large number of possible ways of formulating a search in order to solve it. The choice of search space, neighbourhood scheme, search heuristic and its many possible additions and enhancements are all elements of a search formulation. This paper identifies some of the key relationships between these different elements and how these could impact the overall performance of the search. The framework developed from these relationships helps to classify different search heuristic modifications and identifies areas where relatively little research has been done.
منابع مشابه
A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملA discrete particle swarm optimization algorithm with local search for a production-based two-echelon single-vendor multiple-buyer supply chain
This paper formulates a two-echelon single-producer multi-buyer supply chain model, while a single product is produced and transported to the buyers by the producer. The producer and the buyers apply vendor-managed inventory mode of operation. It is assumed that the producer applies economic production quantity policy, which implies a constant production rate at the producer. The operational pa...
متن کاملEffective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملEvolving Effective Incremental Solvers for Sat with a Hyper-heuristic Framework Based on Genetic Programming
Hyper-heuristics could simply be defined as heuristics to choose other heuristics. In other words, they are methods for combining existing heuristics to generate new ones. In this paper, we use a grammar-based genetic programming hyperheuristic framework. The framework is used for evolving effective incremental solvers for SAT. The evolved heuristics perform very well against well-known local s...
متن کاملHybridisations within a Graph Based Hyper-heuristic Framework for University Timetabling Problems
A significant body of literature has explored various research directions in hyper-heuristics (which can be thought as heuristics to choose heuristics). In this paper we define a graph based hyper-heuristic (GHH) framework and compare the performance of a number of local search based searching algorithms as the high level heuristics. They are used to search upon permutations of low level graph ...
متن کاملGenerating SAT Local-Search Heuristics Using a GP Hyper-Heuristic Framework
We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain “disposable” heuristics which are evolved and used for a specific subset of instances of a problem. We test the heuristics evolved by GP-HH against well-known local-search heuristics on a variety of benchmark SAT problems. Results are very encouraging.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000